Novel Approach of Designing Spreading Code using Genetic Algorithm

نویسندگان

  • ARNAB SHASHI HAZARI
  • SIMITA KUNDU
  • ABHIJIT CHANDRA
چکیده

Modern communication systems extensively use Code Division Multiple Access (CDMA) technology that associates one unique code to each user. Therefore the generation of these spreading codes has drawn considerable attention amongst the researchers with a fundamental requirement of having as much distinct members as possible along with a constraint of minimizing the inter-code correlation. Since the operation of trade-off between the number of unique codes and peak cross-correlation value is nothing but a task of optimization; one such intelligent technique called Genetic Algorithm (GA) has been employed in this paper for the design of spreading codes. This has proved the uniqueness of our code generation algorithm over existing ones as it provides flexibility in selecting the number of orthogonal code pairs even when the codelength is constant. Interdependence between the characteristics of the designed code and the parameters of genetic optimization has been revealed by means of a number of design examples. Inherent properties of the GA-optimized spreading code have been analyzed from a number of perspectives. Finally, the worth of the proposed code in current wireless system has been substantiated by comparing its performance with other stateof-the-art spreading codes. Key-words: Code Division Multiple Access (CDMA), Genetic Algorithm (GA), Kasami sequence, Orthogonal Gold code, Semi-Orthogonal Modified Large Set Kasami (SOMLK) sequence, Small Set Orthogonal Kasami (SSOK) code, Walsh code

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Novel Multi-user Detection Approach on Fluctuations of Autocorrelation Estimators in Non-Cooperative Communication

Recently, blind multi-user detection has become an important topic in code division multiple access (CDMA) systems. Direct-Sequence Spread Spectrum (DSSS) signals are well-known due to their low probability of detection, and secure communication. In this article, the problem of blind multi-user detection is studied in variable processing gain direct-sequence code division multiple access (VPG D...

متن کامل

An Optimized PID for Capsubots using Modified Chaotic Genetic Algorithm (RESEARCH NOTE)

This paper proposes a design for a mesoscale capsule robot which can be used in gaining diagnostic data and delivering medical treatment in inaccessible parts of the human body. A novel approach is presented for the capsule robot control: A PID-controlled closed-loop approach. A modified chaotic genetic algorithm will be used to optimize the coefficients of PID controller. Then, simulation will...

متن کامل

Power System Stability Improvement via TCSC Controller Employing a Multi-objective Strength Pareto Evolutionary Algorithm Approach

This paper focuses on multi-objective designing of multi-machine Thyristor Controlled Series Compensator (TCSC) using Strength Pareto Evolutionary Algorithm (SPEA). The TCSC parameters designing problem is converted to an optimization problem with the multi-objective function including the desired damping factor and the desired damping ratio of the power system modes, which is solved by a SPEA ...

متن کامل

A Novel QSAR Model for the Evaluation and Prediction of (E)-N’-Benzylideneisonicotinohydrazide Derivatives as the Potent Anti-mycobacterium Tuberculosis Antibodies Using Genetic Function Approach

Abstract A dataset of (E)-N’-benzylideneisonicotinohydrazide derivatives as a potent anti-mycobacterium tuberculosis has been investigated utilizing Quantitative Structure-Activity Relationship (QSAR) techniques. Genetic Function Algorithm (GFA) and Multiple Linear Regression Analysis (MLRA) were used to select the descriptors and to generate the correlation QSAR models that relate the Mi...

متن کامل

A novel hybrid genetic algorithm to solve the make-to-order sequence-dependent flow-shop scheduling problem

Flow-shop scheduling problem (FSP) deals with the scheduling of a set of n jobs that visit a set of m machines in the same order. As the FSP is NP-hard, there is no efficient algorithm to reach the optimal solution of the problem. To minimize the holding, delay and setup costs of large permutation flow-shop scheduling problems with sequence-dependent setup times on each machine, this pap...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014